Energy-Efficient Node Selection in Multihop Wirelessntworks

In a single-hop network with multiple relays, selecting a single node to aid in the transmission between a source and a destination outperforms both traditional orthogonal transmissions and distributed space-time codes. The usage of multiple hops will further improve the wireless communication. This paper presents an energy efficient selection of cooperative nodes with respect to their geographical location and the number of nodes participating in cooperative communications in wireless networks. Here, we first give a simple localized routing algorithm, called Localized Energy-Aware Restricted Neighborhood routing (LEARN), which can guarantee the energy efficiency of its route if it can find the route successfully. We then theoretically study its critical transmission radius in random networks which can guarantee that LEARN routing finds a route for any source and destination pairs asymptotically almost surely. We also extend the proposed routing into three-dimensional (3D) networks and derive its critical transmission radius in 3D random networks. The simulation result shows that the proposed node selection scheme will results in better selection of nodes for large scale random networks.